Matching game for learning enhancement

ABSTRACT

A matching-based competitive game is used to reinforce the association, correlation, translation, or equation of values. The values are indicia on the face of the tiles, where each tile has at least two different indicia. These values may be cross-language vocabulary words, geographic entities, arithmetic valuations, or chemical symbols, as examples. The classic game of dominoes provides a single tile for every combination of two values in the value set, including the identity element. Because the mathematical increase in combinations, and thus the size of the tile set, becomes prohibitively large for a reasonably-sized value set, the tile set is reduced, resulting in a group of smaller tile sets, having essentially the same statistical matching capability of a normal domino set. The winner(s) of the game are defined as the first player(s) who complete a predetermined number of matches of the indicia values on their tiles.

1. FIELD OF THE INVENTION

The present invention relates generally to games in which the playerschoose pieces with n indicia thereon, for which an object of the gamesis to make a string of the pieces for which indicia of adjacent endsmatch. The game ends when the string of one of the players has apredetermined number. More specifically, the present invention relatesto games in which the players choose a manageable subset of pieces withn indicia thereon, for which an object of the games is to make a stringof the pieces, for which indicia of adjacent ends match.

2. BACKGROUND

The classic domino set entails a total of seven (7) values or indicia,which, in exhaustive combination with one another (including theidentity tile in which both halves of the tile have the same value)produces a 28-piece tile set. The mathematics of such combinationsyields progressively larger tile sets for each additional value, sothat, e.g., a zero-to-nine domino set has 55 tiles, and a zero-to-twelvedomino set has 91 tiles.

Therefore, games involving matching indicia of adjacent ends of thetiles require increasingly larger tile sets as the number of values orindicia increases. Such games having increasingly larger tile sets maybe accompanied by increased cost.

There is a need for games involving matching indicia of adjacent ends ofthe tiles to have a manageable subset of pieces with n indicia thereonto reduce the cost of such games when the numbers of values or indiciaincreases.

SUMMARY OF THE INVENTION

A first aspect of the present invention provides a game set, comprising:a plurality of pieces. Each piece has a first surface. The first surfacehas a plurality of oppositely disposed ends. Each oppositely disposedend of said first surface has an indicium of one of n valuesincorporated within the game set, thereon. N is a positive integer. Saidn indicia comprise sets j, k, . . . , that associate, correlate,translate, or equate concepts. Each of the sets j, k, . . . is anaggregate of a plurality S of respective subsets A, B, C, . . . , eachsubset comprising all combinations of any values which may berepresented as 1 to p. The number S of said subsets A, B, C, . . . isgreater than 1, i.e. does not include the identity subset A. Each nvalue comprises {jA₁, jA₂, . . . JAp, jB₁, jB₂, . . . , jB_(p), jC₁ . .. } and {kA₁, kA₂, . . . , kA_(p), kB₁, kB₂, . . . , kB_(p), kC₁ . . .}. The n values assigned to j(1 to n) and k(1 to n) are mathematicallyshuffled such that a regular tabulation of the values of (j,k){A₁, A₂,A₃, . . . C_(p)} loses full correlation.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a top plan view of a game set, in accordance withembodiments of the present invention; and

FIG. 2 depicts a side cross-sectional view of the game set illustratedin FIG. 1, in accordance with embodiments of the present invention.

DESCRIPTION OF EMBODIMENTS OF THE INVENTION

FIG. 1 depicts a top plan view of a game set 10, comprising: a pluralityof pieces 11, 13. The pieces 11, 13 may be tiles or cards or anyappropriate solid object. In one embodiment, the pieces mayadvantageously be fabricated wood, plastic, metal, paper, linen, or anelectronic representation. Each piece 11, 13 has a first surface 17, 22respectively. Each oppositely disposed ends 35, 33 and 37, 36 of saidfirst surface 17, 22 of each piece 11, 13 has an indicium of one of nvalues incorporated within the game set 10, thereon. The oppositelydisposed ends 35, 33 and 37, 36 of said first surface 17, 22 of eachpiece 11, 13 may be separated by dividers 30, 32, respectively. N is apositive integer. Said n indicia comprise sets j, k, . . . , thatassociate, correlate, translate, or equate concepts. Each of the sets j,k, . . . is an aggregate of a plurality S of respective subsets A, B, C,. . . Each of the sets j, k, . . . is an aggregate of a plurality S ofrespective subsets A, B, C, . . . , each subset comprising allcombinations of any values which may be represented as 1 to p. Thenumber S of said subsets A, B, C, . . . is greater than 1, i.e. does notinclude the identity subset A. Each n value comprises {jA₁, jA₂, . . . ,JAp, jB₁, jB₂, . . . , jB_(p), jC₁ . . . } and {kA₁, kA₂, . . . ,kA_(p), kB₁, kB₂, . . . , kB_(p), kC₁ . . . }. The n values assigned toj(1 to n) and k(1 to n) are mathematically shuffled such that a regulartabulation of the values of (j,k){A₁, A₂, A₃, . . . C_(p)} loses fullcorrelation.

The game set 10 described herein is intended to assist the memorizationof correlated facts such as foreign-language vocabulary, countries andcapitals, or chemical symbols, in a learning environment suitable toprimary grades through secondary education.

The game set 10 is based upon the classic game Dominoes. The pairing, ormatching, facet of the domino concept can be used to accommodate thetranslation of concepts. There are, however, several limitations toclassic dominoes, were that game used for this purpose.

First, the classic domino set entails a total of seven (7) variables,which, in exhaustive combination with one another (including theidentity tile, both halves the same value) produces a 28-piece tile set.The mathematics of such combinations yields progressively larger tilesets for each addition of a further variable, so that, e.g., azero-to-nine domino set has 55 tiles, and a zero-to-twelve domino sethas 91 tiles.

Second, the classic domino set makes no provision forconcept-translation; i.e., it is a simple one-to-one match.

Third, the objective of dominoes—to exhaust one's tiles—requires alength of time disproportionately large to the time usually available ina classroom for such activity, particularly since any increase in thevalue set (above the basic seven variables) results in concomitantincreases in the length of time to play the game; conversely, as ateaching tool, using the historical seven values provides results oflimited worth for given effort.

One objective of the present invention is to replicate all the membersof the value set in both representations; for instance, a value set of18 vocabulary words in English (the “j” set) is also instantiated as thesame 18 words in Spanish vocabulary (the “k” set). The words are dividedinto three pairs of subsets of six values each. The domino “match”requires that juxtaposed domino placement translate from the j set tothe k set or vice versa. However, the division into subsets in the twosets is different, so that as one moves back and forth between matchingj and k, the play moves in and out of the different subsets, providingaccess throughout the game to all values within the game. Concurrently,the division into subsets limits the total number of tiles to areasonable value. Last, although the game may be played as a classicdomino game, a suggested outcome determined by the length of a tilestring forces an end to the game within a short period of time, makingit suitable for the classroom environment.

Referring to FIG. 1, the game described herein may use a game board 18,e.g., a horse-race track, in an embodiment for placing at least onestring 40, 42, 43, 44, 45, 46 of pieces 11, 13 on surface 16, extendingfrom starting line 12 to finish line 14. Alternatively, the pieces 11,13 may be placed on an unspecified playing surface. The choice of a gameboard, 18, such as a horse track, is an alternative embodiment.

FIG. 2 depicts a side cross-sectional view of the game set 10illustrated in FIG. 1, and described in associated text herein. Pieces11, 13, may have second surfaces 30, 29, respectively, that face awayfrom the surfaces 17 and 22 and face toward the surface 16 of the gameboard 18, so that the pieces may lie on the surface 16 of the game board18. The string of pieces 11, 13 may extend in an array from the startingline 12 to the finish line 14 of the game board 18.

In one embodiment, a pairing of set membership of each piece is selectedfrom the group consisting of {j,j}, {k,k}, and {j,k}.

In one embodiment, a pairing of set membership of the respective ends35, 33 and 37, 36 of each piece 11, 13 is unrelated to any content ofany other face or end 35, 33 and 37, 36 of each piece 11, 13.

In one embodiment, n is greater than 6.

In one embodiment, the pairing of set membership of each piece 11, 13 is{j,k}, and the j set comprises words or phrases, in one language, andthe k set comprises translations of the words or phrases into anotherlanguage.

In one embodiment, divisions within the datasets or subsets areunbalanced.

In one embodiment, the indicia of forms j, k . . . may be any of aglyph, a picture, a word, or expansion thereof.

In one embodiment, the pieces are arranged in a string(s) 40, 42, 43,44, 45, 46 of pieces 11, 13.

In one embodiment, the pieces are arranged in multiple strings 40, 42,43, 44, 45, 46 of pieces 11, 13, wherein one of the strings 40, 42, 43,44, 45, 46 of pieces 11, 13 has a predetermined length which determinesthe end point of a game. In one embodiment, the string length isadvantageously 10 pieces 11, 13.

EXAMPLE 1

In one example, the game set 10 uses a set of eighteen (18) variables(values) in each of two correlative datasets. While this would in itsnormal environment most likely be, for instance, eighteen words in eachof English and Spanish languages, for the purposes of this example thesevariables shall be assumed to be eighteen letters of the alphabet ineach of upper case and lower case, and the correlation component of thegame to require that a lower case letter is matched to the correspondingupper case letter and vice versa.

The surface 17 of each end 35, 33 of piece 11 is imprinted with indiciafrom an input value set j (upper case): A, B, C, D, E, F, G, H, I, J, K,L, M, N, O, P, Q, R. The surface 22 of each end 37, 36 of piece 13 isimprinted with indicia from an input value set k (lower case): a, b, c,d, e, f, g, h, i, j, k, I, m, n, o, p, q, r. Each of these data sets isorganized into three subsets. The j subsets are formed by a simplepartition of the data into three segments: {A, B, C, D, E, F}; {G, H, I,J, K, L}; and {M, N, O, P, Q, R}. The k subsets are formed by sequentialdistribution of the values into the subsets, yielding: {a, d, g, j, m,p}; {b, e, h, k, n, q}; and {c, f, i, l, o, r}.

A game set 10, less the identity (“doubles”) piece (identical indicia),is then formed of each of the six subsets; these subsets, in theaggregate, yield the following complete set of 90 unique game tiles,listed in Table I.

TABLE 1 Game set 10, less the identity (“doubles”) piece (identicalindicia). AB, AC, AD, AE, AF, BC, BD, BE, BF, CD, CE, CF, DE, DF, EF;GH, GI, GJ, GK, GL, HI, HJ, HK, HL, IJ, IK, IL, JK, JL, KL; MN, MO, MP,MQ, MR, NO, NP, NQ, NR, OP, OQ, OR, PQ, PR, QR; ad, ag, aj, am, ap, dg,dj, dm, dp, gj, gm, gp, jm, jp, mp; be, bh, bk, bn, bq, eh, ek, en, eq,hk, hn, hq, kn, kq, nq; cf, ci, cl, co, cr, fi, fl, fo, fr, il, io, ir,lo, lr, or.

For a given instantiation of a number of j elements n and the number ofj subsets S, the game set 10 size becomes (n*(n/S−1)). The game set 10has thus, in the manner described, been reduced to a size at oncemanageable and yet sufficient to play a dominoes-like game.

The medium on which this embodiment is played is a game board 18 forplacing the strings 40, 42, 43, 44, 45, 46 of pieces 11, 13 on surface16, extending from starting line 12 to finish line 14. This gives theimpression that the players are racing horses; the winner of the game isthe owner of the “horse” (string) that first attains a length of tenpieces 11, 13.

The game set 10 can be played as a solitaire or two-player game.Alternatively, it may be played as competitive domino strings of tenmatches with three to five players.

The foregoing description of the embodiments of this invention has beenpresented for purposes of illustration and description. It is notintended to be exhaustive or to limit the invention to the precise formdisclosed, and obviously, many modifications and variations arepossible.

1) A game set, comprising: a plurality of pieces, wherein each piece hasa first surface, wherein the first surface has a plurality of oppositelydisposed ends, wherein each oppositely disposed end of said firstsurface has an indicium of one of n values incorporated within the gameset, thereon, wherein n is a positive integer, wherein said n indiciacomprise sets j, k, . . . , that associate, correlate, translate, orequate concepts, wherein each of the sets j, k, . . . is an aggregate ofa plurality S of respective subsets A, B, C, . . . , each subsetcomprising all combinations of any values which may be represented as 1to p, wherein the number S of said subsets A, B, C, does not include theidentity subset A, wherein n value comprises {jA₁, jA₂, . . . , JAp,jB₁, jB₂, . . . , jB_(p), jC₁ . . . } and {kA₁, kA₂, . . . , kA_(p),kB₁, kB₂, . . . , kB_(p), kC₁ . . . }, and wherein n values assigned toj(1 to n) and k(1 to n) are mathematically shuffled such that a regulartabulation of the values of (j,k){A₁, A₂, A₃, . . . C_(p)} loses fullcorrelation. 2) The game set of claim 1, wherein a pairing of setmembership of each piece is selected from the group consisting of {j,j},{k,k}, and {j,k}. 3) The game set of claim 1, wherein a pairing of setmembership of the respective ends of each piece is unrelated to anycontent of any other face or end. 4) The game set of claim 1, wherein nis greater than
 6. 5) The game set of claim 2, wherein the pairing ofset membership of each piece is {j,k}, and the j set comprises words orphrases, in one language, and the k set comprises translations of thewords or phrases into another language. 6) The game set of claim 1,wherein divisions within the datasets or subsets are unbalanced. 7) Thegame set of claim 1, wherein the indicia of forms j, k . . . may be anyof a glyph, a picture, a word, or expansion thereof. 8) The game set ofclaim 1, wherein the pieces are fabricated from materials selected fromthe group consisting of wood, plastic, metal, paper, linen, and anelectronic representation. 9) The game set of claim 1, wherein thepieces are arranged in a string. 10) The game set of claim 1, whereinthe pieces are arranged in multiple strings, wherein one of the stringshas a predetermined length which determines the end point of a game.